A variable step implicit block multistep method for solving first-order ODEs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable Step Block Backward Differentiation Formula for Solving First Order Stiff ODEs

block method based on Backward Differentiation Formulae (BDF) of variable step size for solving first order stiff initial value problems (IVPs) for Ordinary Differential Equations (ODEs). In a 2-point Block Backward Differentiation Formula (BBDF), two solution values are produced simultaneously. Plots of their regions of absolute stability for the method are also presented. The efficiency of th...

متن کامل

Fifth Order Variable Step Block Backward Differentiation Formulae for Solving Stiff ODEs

The implicit block methods based on the backward differentiation formulae (BDF) for the solution of stiff initial value problems (IVPs) using variable step size is derived. We construct a variable step size block methods which will store all the coefficients of the method with a simplified strategy in controlling the step size with the intention of optimizing the performance in terms of precisi...

متن کامل

Two Point Fully Implicit Block Direct Integration Variable Step Method for Solving Higher Order System of Ordinary Differential Equations

Two point fully implicit block method of variable step size is developed for solving directly the second order system of Ordinary Differential Equations (ODEs). This method will estimate the solutions of Initial Value Problems (IVPs) at two points simultaneously. The method developed is suitable for the numerical integration of non stiff and mildly stiff differential systems. Numerical results ...

متن کامل

A first-order block-decomposition method for solving two-easy-block structured semidefinite programs

In this paper, we consider a first-order block-decomposition method for minimizing the sum of a convex differentiable function with Lipschitz continuous gradient, and two other proper closed convex (possibly, nonsmooth) functions with easily computable resolvents. The method presented contains two important ingredients from a computational point of view, namely: an adaptive choice of stepsize f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2010

ISSN: 0377-0427

DOI: 10.1016/j.cam.2009.10.023